Lecture 1 : Introduction , the Matching Polynomial
نویسنده
چکیده
The Geometry of Polynomials, also known as the analytic theory of polynomials, refers the study of the zero loci of polynomials with complex coefficients (and their dynamics under various transformations of the polynomials) using methods of real and complex analysis. The course will focus on the fragment of this subject which deals with real-rooted polynomials and their multivariate generalizations, real stable and hyperbolic polynomials. We will explore this area via its interactions with questions in combinatorics, probability, and linear algebra, some of which will be algorithmically motivated. Specifically, we will be interested in the following kind of question: how are the properties of a graph/matrix/probability distribution reflected in the zeros of various generating polynomials associated with it? We begin by presenting two of the simplest examples of this interplay.
منابع مشابه
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملCs 598csc: Combinatorial Optimization 1 Min Cost Perfect Matching
In this lecture, we will describe a strongly polynomial time algorithm for the minimum cost perfect matching problem in a general graph. Using a simple reduction discussed in lecture 9, one can also obtain an algorithm for the maximum weight matching problem. We also note that when discussing perfect matching, without loss of generality, we can assume that all weights/costs are non-negative (wh...
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope 12.1 Formulation of General Perfect Matching
In this lecture, the focus is on general perfect matching problem where the goal is to prove that it can be solved in polynomial time by linear programming. Based on the LP formulation for bipartite matching studied in Lecture 10, we add some valid inequalities to establish a new formulation. Then we prove that for general perfect matching, all vertex solutions of the linear program are integra...
متن کاملLecture 13: Oct 20
Last time we saw an MCMC algorithm that samples matchings M in an undirected graph G = (V,E) from the Gibbs distribution πλ(M) = 1 Z(λ)λ |M | with running time poly(n, λ), where n = |V |. Here the normalizing factor Z(λ) = ∑ M λ |M | = ∑ kmkλ , where mk is the number of k-matchings in G, is known in the statistical physics context as the partition function, and in the combinatorial context as t...
متن کامل1 Introduction to residues and resultants
This chapter is an expanded version of the lecture notes prepared by the second-named author for her introductory course at the CIMPA Graduate School on Systems of Polynomial Equations held in Buenos Aires, Argentina, in July 2003. We present an elementary introduction to residues and resultants and outline some of their multivariate generalizations. Throughout we emphasize the application of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015